Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories

نویسندگان

چکیده

In this survey, we report our recent work concerning combination results for interpolation and uniform in the context of quantifier-free fragments first-order theories. We stress model-theoretic algebraic aspects connecting topic with amalgamation, strong model-completeness. give sufficient (and, relevant situations, also necessary) conditions transfer property to combined theories; investigate non-disjoint signature case under assumption that shared theory is universal Horn. For convex, strong-amalgamating, stably infinite theories over disjoint signatures, provide a modular result existence interpolants. Model completions play key role whole paper: They enter into represent semantic counterpart

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Craig Interpolation for Quantifier-Free Presburger Arithmetic

Craig interpolation has become a versatile algorithmic tool for improving software verification. Interpolants can, for instance, accelerate the convergence of fixpoint computations for infinite-state systems. They also help improve the refinement of iteratively computed lazy abstractions. Efficient interpolation procedures have been presented only for a few theories. In this paper, we introduce...

متن کامل

Ground Interpolation for Combined Theories

We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof tree obtained from an unsatifiability run of the solver into a proof tree without occurrences of troublesome “uncolorable” literals. An interpolant can then be readily generated using existing procedures. The principal advantage...

متن کامل

A Parametric Interpolation Framework for First-Order Theories

Craig interpolation is successfully used in both hardware and software model checking. An important class of state-of-the-art interpolation algorithms is based on recursive procedures that generate interpolants from refutations of unsatisfiable conjunctions of formulas. We analyze this type of algorithms and develop a theoretical framework, called a parametric interpolation framework, for arbit...

متن کامل

Craig Interpolation and Access Interpolation with Clausal First-Order Tableaux

We show methods to extract Craig-Lyndon interpolants and access interpolants from clausal first-order tableaux as produced by automated first-order theorem provers based on model elimination, the connection method, the hyper tableau calculus and instance-based methods in general. Smullyan introduced an elegant method for interpolant extraction from “non-clausal” first-order tableaux. We transfe...

متن کامل

Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic

Craig interpolation has emerged as an effective means of generating candidate program invariants. We present interpolation procedures for the theories of Presburger arithmetic combined with (i) uninterpreted predicates (QPA+UP), (ii) uninterpreted functions (QPA+UF) and (iii) extensional arrays (QPA+AR). We prove that none of these combinations can be effectively interpolated without the use of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10030461